Regret-Minimizers and Convergence to Price-Taking

نویسنده

  • Rachel C. Shafer
چکیده

This paper studies a variety of forms of regret minimization as the criteria with which traders choose their bids/asks in a double auction. Unlike the expected utility maximizers that populate typical market models, these traders do not determine their actions using a single prior. The analysis proves that minimax regret traders will not converge to price-taking as the number of traders in the market increases, contrary to standard economic intuition. In fact, minimax regret traders’ bids and asks are invariant to the number of other traders in the market. However, not all regret-based decision rules fail to respond to market size. Introducing priors over some part of the decision problem to minimize expected maximum regret, or multiple priors to minimize maximum expected regret, have different effects. The robustness of the sealed bid double auction is limited by the need to avoid priors that eliminate traders incentive to truthfully reveal their redemption values.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Regret Minimization Approach in Product Portfolio Management with respect to Customers’ Price-sensitivity

In an uncertain and competitive environment, product portfolio management (PPM) becomes more challenging for manufacturers to decide what to make and establish the most beneficial product portfolio. In this paper, a novel approach in PPM is proposed in which the environment uncertainty, competitors’ behavior and customer’s satisfaction are simultaneously considered as the most important criteri...

متن کامل

Eect of risk perspective on fertilizer choice by sharecroppers

Peanut and corn are two major crops in the tri-state area of the southeast USA, an area encompassing north Florida, southwest Georgia, and southeast Alabama. Sharecroppers in this region apply higher amount of input in crop production than the average farmers. We analyzed the behavior of sharecroppers in this region with regard to their fertilizer application decisions. Two hypotheses were form...

متن کامل

Regret Minimization in Behaviorally-Constrained Zero-Sum Games

No-regret learning has emerged as a powerful tool for solving extensive-form games. This was facilitated by the counterfactual-regret minimization (CFR) framework, which relies on the instantiation of regret minimizers for simplexes at each information set of the game. We use an instantiation of the CFR framework to develop algorithms for solving behaviorally-constrained (and, as a special case...

متن کامل

The Price of Bandit Information for Online Optimization

In the online linear optimization problem, a learner must choose, in each round, a decision from a setD ⊂ R in order to minimize an (unknown and changing) linear cost function. We present sharp rates of convergence (with respect to additive regret) for both the full information setting (where the cost function is revealed at the end of each round) and in the bandit setting (where only the scala...

متن کامل

Behavioural and Dynamical Scenarios for Contingent Claims Valuation in Incomplete Markets

We study the problem of determination of asset prices in an incomplete market proposing three different but related scenarios. One scenario uses a market game approach whereas the other two are based on risk sharing or regret minimizing considerations. Dynamical schemes modeling the convergence of the buyer’s and of the seller’s prices to a unique price are proposed. MSC2000 : 91B24, 91B26, 60H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015